DEFAULT QUANTIFIER LOGIC A canonical framework for monotonic reasoning with first-order default knowledge
نویسنده
چکیده
In this paper we present a powerful uniform first-order framework for representing and reasoning with complex forms of default knowledge. This is achieved by extending first-order predicate logic with a new generalized quantifier, anchored in the quasi-probabilistic ranking measure paradigm [Weydert 94], which subsumes and refines the original, propositional notion of a default conditional [Delgrande 88, Weydert 91, Boutilier 94].
منابع مشابه
Syntax and Semantics of a Monotonic Framework for Non-Monotonic Reasoning
We present the proof theory and the model theory of a monotonic framework for default reasoning, and we extend logic programming techniques to this framework. Standard for-malizations of default reasoning do not syntactically separate between hard knowledge and conjectural knowledge. Such a separation is fundamental in our framework. To illustrate our approach, we show how it solves the Yale Sh...
متن کاملDefault Reasoning over Domains and Concept Hierarchies
W.C. Rounds and G.-Q. Zhang have proposed to study a form of disjunctive logic programming generalized to algebraic domains [1]. This system allows reasoning with information which is hierarchically structured and forms a (suitable) domain. We extend this framework to include reasoning with default negation, giving rise to a new nonmonotonic reasoning framework on hierarchical knowledge which e...
متن کاملSome Promstk~ of Knowledge Information Inferred by Two Inter+ive
I. INTRODUCTION A new concept of beliefs called interactiue uxrension which are derivable from two interconnected default reasoning rystems is proposed. and its properties are discussed. Default reasoning proposed by R. Reiter is suitable for incomplete knowledge reasoning in artificial intellJgence, logic programming and deductive database, because it can draw plausible conclusions from the in...
متن کاملStable Model Semantics Algorithm: Approach Based on Relation of Blocking Between Sets of Defaults
In the last years computational logic, and particularly non-monotonic reasoning, was introduced as a theory suitable for specification and implementation of multiagent systems. In this context, fast algorithms for reasoning in computational logics are vitally important to support an industrial applications of such systems. In this paper we investigate the properties of sets of default assumptio...
متن کاملNon-monotonic Reasoning in Artificial Intelligence
In this article we introduce a non-monotonic reasoning engine, i.e., the assumption-based truth maintenance system, and two reasoning paradigms for solving the diagnosis problem that are based on this engine. The objective of the article is to present solutions for problems occurring in classical expert systems based on first-order or propositional logic. In particular, we show how to handle in...
متن کامل